Parallel Solution to the Dominating Set Problem by Tile Assembly System
نویسندگان
چکیده
منابع مشابه
Parallel Solution to the Dominating Set Problem by Tile Assembly System
The dominating set problem is a well known NP hard problem. It means that as the instance size grows, they quickly become impossible to solve on traditional digital computers. Tile assembly model has been demonstrated as a highly distributed parallel model of computation. Algorithmic tile assembly has been proved to be Turing-universal. This paper proposes a tile assembly system for the dominat...
متن کاملFast parallel molecular solution to the dominating-set problem on massively parallel bio-computing
This paper shows how to use DNA strands to construct solution space of molecules for the dominating-set problem and how to apply biological operations to solve the problem from the solution space of molecules. In order to achieve this, we have proposed some DNA based parallel algorithms using the operations in Adleman–Lipton model, together with the analysis of the computational complexity for ...
متن کاملEdge-Dominating Set Problem
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...
متن کاملThe Wake Up Dominating Set Problem
Recently developed wake-up receivers pose a viable alternative for duty-cycling in wireless sensor networks. Here, a special radio signal can wake up close-by nodes. We model the wake-up range by the unit-disk graph. Such wake-up radio signals are very energy expensive and limited in range. Therefore, the number of signals must be minimized. So, we revisit the Connected Dominating Set (CDS) pro...
متن کاملOne Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
In the classical model of tile self-assembly, unit square tiles translate in the plane and attach edgewise to form large crystalline structures. This model of self-assembly has been shown to be capable of asymptotically optimal assembly of arbitrary shapes and, via information-theoretic arguments, increasingly complex shapes necessarily require increasing numbers of distinct types of tiles. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080143